package demo3;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 邓大帅
 * Date: 2024-01-14
 * Time: 14:04
 */
public class MyCircularQueue {
    private int[] elem;
    private int front;
    private int rear;

    public MyCircularQueue(int k) {
        this.elem = new int[k+1];
    }
    public boolean iSFull() {
        return (rear + 1) % elem.length == front;
    }
    public boolean enQueue(int value) {
        if (iSFull()) {
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1) % elem.length;
        return true;
    }
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front = (front + 1) % elem.length;
        return true;
    }
    public int getFront() {
        if (isEmpty()) {
            return -1;
        }
        return elem[front];
    }
    public int getRear() {
        if (isEmpty()) {
            return -1;
        }
        int index = (rear == 0) ? elem.length - 1 : rear - 1;
        return elem[index];
    }
    public boolean isEmpty() {
        return front == rear;
    }
}
